QS-Net: Reconstructing Phylogenetic Networks Based on Quartet and Sextet
نویسندگان
چکیده
منابع مشابه
Quartet-net: a quartet-based method to reconstruct phylogenetic networks.
Phylogenetic networks can model reticulate evolutionary events such as hybridization, recombination, and horizontal gene transfer. However, reconstructing such networks is not trivial. Popular character-based methods are computationally inefficient, whereas distance-based methods cannot guarantee reconstruction accuracy because pairwise genetic distances only reflect partial information about a...
متن کاملQuartet consistency count method for reconstructing phylogenetic trees
Among the distance based algorithms in phylogenetic tree reconstruction, the neighbor-joining algorithm has been a widely used and effective method. We propose a new algorithm which counts the number of consistent quartets for cherry picking with tie breaking. We show that the success rate of the new algorithm is almost equal to that of neighbor-joining. This gives an explanation of the qualita...
متن کاملT-REX: reconstructing and visualizing phylogenetic trees and reticulation networks
UNLABELLED T-REX (tree and reticulogram reconstruction) is an application to reconstruct phylogenetic trees and reticulation networks from distance matrices. The application includes a number of tree fitting methods like NJ, UNJ or ADDTREE which have been very popular in phylogenetic analysis. At the same time, the software comprises several new methods of phylogenetic analysis such as: tree re...
متن کاملOn Tree-Based Phylogenetic Networks
A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree-based networks. We present a simple necessary and sufficient condition for tree-based networks and prove that a universal tree-based network exists for any number of taxa that contains as its base every phylogenetic tree on the same set of ...
متن کاملOn the maximum quartet distance between phylogenetic trees
A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on n leaves is at most ( 23 + o(1)) ( n 4 ) . Using the machinery of flag algebras we improve the currently known bounds regarding this conjecture, in particular we show that the maximum is at most (0.69 + o(1)) ( n 4 ) . We also give further evidence that the conjecture is true by prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Frontiers in Genetics
سال: 2019
ISSN: 1664-8021
DOI: 10.3389/fgene.2019.00607